Random Walks on Barycentric Subdivisions and the Strichartz Hexacarpet
نویسندگان
چکیده
منابع مشابه
Percolation on the Non-p.c.f. Sierpiński Gasket and Hexacarpet
We investigate bond percolation on the non-p.c.f. Sierpiński gasket and the hexacarpet. With the use of the diamond fractal, we are able to bound the critical probability of percolation on the non-p.c.f. gasket from above by √ 5−1 2 , or approximately 0.618. We then show how the two fractals are related via the barycentric subdivisions of a triangle: the two spaces exhibit duality properties al...
متن کاملOn Face Vectors of Barycentric Subdivisions of Manifolds
We study face vectors of barycentric subdivisions of simplicial homology manifolds. Recently, Kubitzke and Nevo proved that the g-vector of the barycentric subdivision of a Cohen–Macaulay simplicial complex is an M -vector, which in particular proves the g-conjecture for barycentric subdivisions of simplicial homology spheres. In this paper, we prove an analogue of this result for Buchsbaum sim...
متن کاملThe Lefschetz Property for Barycentric Subdivisions of Shellable Complexes
We show that an ’almost strong Lefschetz’ property holds for the barycentric subdivision of a shellable complex. From this we conclude that for the barycentric subdivision of a CohenMacaulay complex, the h-vector is unimodal, peaks in its middle degree (one of them if the dimension of the complex is even), and that its g-vector is an M -sequence. In particular, the (combinatorial) g-conjecture ...
متن کاملThe Multiplicity Conjecture for Barycentric Subdivisions
For a simplicial complex ∆ we study the effect of barycentric subdivision on ring theoretic invariants of its StanleyReisner ring. In particular, for Stanley-Reisner rings of barycentric subdivisions we verify a conjecture by Huneke and Herzog & Srinivasan, that relates the multiplicity of a standard graded k-algebra to the product of the maximal shifts in its minimal free resolution up to the ...
متن کاملUniversality for Barycentric subdivision
The spectrum of the Laplacian of successive Barycentric subdivisions of a graph converges exponentially fast to a limit which only depends on the clique number of the initial graph and not on the graph itself. Announced in [40]), the proof uses now an explicit linear operator mapping the clique vector of a graph to the clique vector of the Barycentric refinement. The eigenvectors of its transpo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Experimental Mathematics
دوره 21 شماره
صفحات -
تاریخ انتشار 2012